Approximate shared-memory counting despite a strong adversary
نویسندگان
چکیده
منابع مشابه
Learning with a Strong Adversary
In this paper, we propose a method, learning with adversary, to learn a robust network. Our method takes finding adversarial examples as its mediate step. A new and simple way of finding adversarial examples are presented and experimentally shown to be more ‘efficient’. Lastly, experimental results shows our learning method greatly improves the robustness of the learned network.
متن کاملApproximate Counting: A Detailed Analysis
Approximate counting is an algorithm proposed by R. Morris which makes it possible to keep approximate counts of large numbers in small counters. The algorithm is useful for gathering statistics of a large number of events as well as for applications related to data compression (Todd et al.). We provide here a complete analysis of approximate counting which establishes good convergence properti...
متن کاملFragments of Approximate Counting
We study the long-standing open problem of giving ∀Σ1 separations for fragments of bounded arithmetic in the relativized setting. Rather than considering the usual fragments defined by the amount of induction they allow, we study Jeřábek’s theories for approximate counting and their subtheories. We show that the ∀Σ1 Herbrandized ordering principle is unprovable in a fragment of bounded arithmet...
متن کاملApproximate Triangle Counting
Triangle counting is an important problem in graph mining. Clustering coefficients of vertices and the transitivity ratio of the graph are two metrics often used in complex network analysis. Furthermore, triangles have been used successfully in several real-world applications. However, exact triangle counting is an expensive computation. In this paper we present the analysis of a practical samp...
متن کاملApproximate Halfspace Range Counting
We present a simple scheme extending the shallow partitioning data structures of Matoušek, that supports efficient approximate halfspace range-counting queries in R with relative error ε. Specifically, the problem is, given a set P of n points in R, to preprocess them into a data structure that returns, for a query halfspace h, a number t so that (1−ε)|h∩P | ≤ t ≤ (1+ε)|h∩P |. One of our data s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2010
ISSN: 1549-6325,1549-6333
DOI: 10.1145/1721837.1721841